Generalized No-Broadcasting Theorem
نویسندگان
چکیده
منابع مشابه
Generalized no-broadcasting theorem.
We prove a generalized version of the no-broadcasting theorem, applicable to essentially any nonclassical finite-dimensional probabilistic model satisfying a no-signaling criterion, including ones with "superquantum" correlations. A strengthened version of the quantum no-broadcasting theorem follows, and its proof is significantly simpler than existing proofs of the no-broadcasting theorem.
متن کاملNo-local-broadcasting theorem for multipartite quantum correlations.
We prove that the correlations present in a multipartite quantum state have an operational quantum character even if the state is unentangled, as long as it does not simply encode a multipartite classical probability distribution. Said quantumness is revealed by the new task of local broadcasting, i.e., of locally sharing preestablished correlations, which is feasible if and only if correlation...
متن کاملMod 2 degree and a generalized No Retraction Theorem
Three well-known equivalent theorems are the Brouwer Fixed Point Theorem (BFPT), the No Retraction Theorem (NRT) and Sperner’s Lemma (SL). The equivalence of the first two is a standard result in topology. The BFPT can be derived directly from SL, which is often proved combinatorially; it is also known that the BFPT implies SL. See [16] for discussion and references of the interrelations of the...
متن کاملA Simple Proof of a Generalized No Retraction Theorem
The world does not need yet another proof of the classical no retraction theorem (NRT) and its equivalent partner the Brouwer fixed point theorem (BFPT)— many lovely elementary proofs are widely known. What does merit a new proof, however, is a much less well-known generalization of the NRT to a broader class of topological spaces than only those that are homeomorphic to balls (which is what th...
متن کاملBroadcasting in generalized chordal rings
Broadcasting is an information dissemination process in which a message originating at one node of a communication network (modeled as an undirected graph) is sent to all other nodes by means of calls involving two nodes at a time, with each node participating in at most one call at any time. We are interested in efficient broadcasting in a class of cubic graphs known as generalized chordal rin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2007
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.99.240501